A note on packing of two copies of a hypergraph
نویسندگان
چکیده
A 2-packing of a hypergraph H is a permutation σ on V (H) such that if an edge e belongs to E(H), then σ(e) does not belong to E(H). We prove that a hypergraph which does not contain neither empty edge ∅ nor complete edge V (H) and has at most 12n edges is 2-packable. A 1-uniform hypergraph of order n with more than 1 2n edges shows that this result cannot be improved by increasing the size of H.
منابع مشابه
A note on the packing of two copies of some trees into their third power
It is proved in [l] that if a tree T of order n is not a star, then there exists an edgedisjoint placement of two copies of this tree into its fourth power. In this paper, we prove the packing of some trees into their third power. @ 2003 Eisevier Ltd. Ali rights reserved. Keywords-Embedding, Packing, Permutation, Placement, Power tree.
متن کاملInteger and fractional packings in dense 3-uniform hypergraphs
Let 0 be any fixed 3-uniform hypergraph. For a 3-uniform hypergraph we define 0( ) to be the maximum size of a set of pairwise triple-disjoint copies of 0 in . We say a function from the set of copies of 0 in to [0, 1] is a fractional 0-packing of if ¥ e ( ) 1 for every triple e of . Then * 0( ) is defined to be the maximum value of ¥ 0 over all fractional 0-packings of . We show that * 0( ) 0(...
متن کاملA note on careful packing of a graph
Let G be a simple graph of order n and size e(G). It is well known that if e(G) ≤ n− 2, then there is an edge–disjoint placement of two copies of G into Kn. We prove that with the same condition on size of G we have actually (with few exceptions) a careful packing of G, that is an edge–disjoint placement of two copies of G into Kn \ Cn.
متن کاملFractional Decompositions of Dense Hypergraphs
A seminal result of Rödl (the Rödl nibble) asserts that the edges of the complete r-uniform hypergraph Kr n can be packed, almost completely, with copies of Kr k , where k is fixed. We prove that the same result holds in a dense hypergraph setting. It is shown that for every r-uniform hypergraph H0, there exists a constant α = α(H0) < 1 such that every r-uniform hypergraph H in which every (r −...
متن کاملNearly-Perfect Hypergraph Packing is in NC
Answering a question of RR odl and Thoma, we show that the Nibble Algorithm for nding a collection of disjoint edges covering almost all vertices in an almost regular, uniform hypergraph with negligible pair degrees can be derandomized and parallelized to run in polylog time on polynomially many parallel processors. In other words, the nearly-perfect packing problem on this class of hypergraphs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 13 شماره
صفحات -
تاریخ انتشار 2007